|
|
Sorting algorithms
Schwarz, Jakub ; Smrž, Jaroslav (referee) ; Dvořák, Jiří (advisor)
Enormous volume of data, which has been processed during production operations, requires easy orientation and quick searching. Exact search in real time is essential for success. Correct and quick data-sorting is one of the most important activity during dataprocessing. The goal of this bachelor’s thesis is background research of sorting algorithms. To achieve the goal, basic concepts of sorting theory will be described (determined) and there will be division of sorting algorithms by different criterions. For each algorithm of internal array sorting, sorting principles will be described and analysis of efficiency will be provided. The results will be verified by experimental program.
|
|
| |
|
|
Hyperspeed Reach - Audiovisual Performance
Kočišová, Lenka ; Vojtěchovský, Miloš (referee) ; Skočovský, Luděk (referee) ; Palla, Marian (referee) ; Ruller, Tomáš (advisor)
This dissertation thesis describes the phenomenon of audiovisual performance in different connotations. A substantial part is devoted to psychological survey into my own subconscious and subsequently to metaphorical processing of this introspection. An important part of the work is a resume of the general knowledge of the physical properties and its metaphorical application on mental and creative processes. This analysis and explanation of internal cognitive models are implemented in terms of the study of relationships, interactions based on cooperation or confrontation, but also the inability to grasp the objective reality from the subjective position due to the merged distinctions of real and fictional. The importance of audiovisual performance is also studied in linear perspective of history, in order to point out the general principle of repetition patterns, which reveals that audiovisual performances is an activity which is a necessary expression of life itself and not just the concept in the field of arts.
|
|
|
Grover's algorithm in Quantum computing and its applications
Katabira, Joseph ; Návrat, Aleš (referee) ; Hrdina, Jaroslav (advisor)
Kvantová výpočetní technika je rychle rostoucí obor informatiky, který přenáší principy kvantových jevu do našeho každodenního života. Díky své kvantové podstatě získávají kvantové počítače převahu nad klasickými počítači. V této práci jsme se zaměřili na vysvětlení základů kvantového počítání a jeho implementaci na kvantovém počítači. Zejména se zaměřujeme na popis fungování, konstrukci a implementaci Groverova algoritmu jako jednoho ze základních kvantových algoritmů. Demonstrovali jsme sílu tohoto kvantového algoritmu při prohledávání databáze a porovnávali ho s klasickými nekvantovými algoritmy pomocí implementace prostřednictvím simulačního prostředí QISKit. Pro simulaci jsme použili QASM Simulator a State vector Simulator Aer backends a ukázali, že získané výsledky korelují s dříve diskutovanými teoretickými poznatky. Toto ukazuje, že Groverův algoritmus umožňuje kvadratické zrychlení oproti klasickému nekvantovému vyhledávacímu algoritmu, Použitelnost algoritmu stejně jako ostatních kvantových algoritmů je ale stále omezena několika faktory, mezi které patří vysoké úrovně dekoherence a chyby hradla.
|
|
|
DNA Sequence Compression
Friedrich, Tomáš ; Burgetová, Ivana (referee) ; Martínek, Tomáš (advisor)
The increasing volume of biological data requires finding new ways to save these data in genetic banks. The target of this work is design and implementation of a novel algorithm for compression of DNA sequences. The algorithm is based on aligning DNA sequences agains a reference sequence and storing only diferencies between sequence and reference model. The work contains basic prerequisities from molecular biology which are needed for understanding of algorithm details. Next aligment algorithms and common compress schemes suitable for storing of diferencies agains reference sequence are described. The work continues with a description of implementation, which is follewed by derivation of time and space complexity and comparison with common compression algorithms. Further continuation of this thesis is discussed in conclusion.
|
|
| |
|
|
Extrasensory Architecture
Kacetlová, Kateřina ; Eyer, David (referee) ; Mléčka, Jan (advisor)
This thesis sums up the current possibilities of a family house building considering the tradition and the relationship of the inhabitants not only to the landscape but also to themselves. Specifically, it describes the possibility of using natural building materials and creating a variable and vital space considering contemporary family needs. The first part of the sub diploma contains a manual of historical development and current trends in the field of extrasensory perception of architecture. The design part describes a proposal of a family house in the countryside. The results of this study provide a basic insight into the problem and illustrate the practical application of acquired knowledge in the construction of the family house.
|
|
|
Evolutionary Algorithms in the Task of Boolean Satisfiability
Serédi, Silvester ; Vašíček, Zdeněk (referee) ; Sekanina, Lukáš (advisor)
The goal of this Master's Thesis is finding a SAT solving heuristic by the application of an evolutionary algorithm. This thesis surveys various approaches used in SAT solving and some variants of evolutionary algorithms that are relevant to this topic. Afterwards the implementation of a linear genetic programming system that searches for a suitable heuristic for SAT problem instances is described, together with the implementation of a custom SAT solver which expoloits the output of the genetic program. Finally, the achieved results are summarized.
|
|
|
Linguistic complexity of J.K. Rowling's Harry Potter series
Gottwald, Michal ; Malá, Markéta (advisor) ; Jančovičová, Ivana (referee)
This bachelor thesis examines the language complexity in the initial and final volumes of J.K. Rowling's Harry Potter series, testing the hypothesis that the novels' linguistic features, impacting readability, are adjusted to the intended readers' evolving comprehension and reading skills. As the series progresses, the complexity is expected to increase, reflecting the maturation of its audience. The research investigates whether the series' later novels are syntactically and lexically more complex than the earlier ones, with the help of employing corpus stylistic methodology. The theoretical part of this thesis outlines the definition of linguistic complexity and its relation to readability and discusses various methods of analyzing literature from a linguistic perspective. The complexity is measured using various criteria: the number of tokens, types, chapters, sentences, the extent and types of clausal subordination and non-finite clauses. Sentence length and type-token ratio are also considered. The methods include frequency lists and keyword analysis, complemented by a detailed examination of text samples. KEYWORDS complexity, children's literature, sentence structure
|
|
|
Complexity in Cellular Automata
Hudcová, Barbora ; Mikolov, Tomáš (advisor)
In order to identify complex systems capable of modeling artificial life, we study the notion of complexity within a class of dynamical systems called cellu- lar automata. We present a novel classification of cellular automata dynamics, which helps us identify interesting behavior in large automaton spaces. We give a detailed comparison of our results to previous methods of dynamics classification. In the second part of the thesis, we study the backward dynamics of cellular au- tomata. We present a novel representation of one-dimensional cellular automata, which can be used to charcterize all their garden of eden configurations. We demonstrate the usefulness of this method on examples. 1
|
guest ::
